A Wavefront Array for IJRV Decomposition Updating

نویسندگان

  • Arun Raghupathy
  • R. Liu
چکیده

The rank revealing URV decomposition is a useful tool in many signal processing applications that require the computation of the noise subspace of a matrix. In this paper, we look at the problem of updating the URV decomposition arid consider its implementation on a wavefront array. We prlopose a wavefront array for efficient VLSI implementation of the URV decomposition. The array provides a mechanism for accumulating the null space of the matrix as well as for handling rank changes during updating.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Updating finite element model using frequency domain decomposition method and bees algorithm

The following study deals with the updating the finite element model of structures using the operational modal analysis. The updating process uses an evolutionary optimization algorithm, namely bees algorithm which applies instinctive behavior of honeybees for finding food sources. To determine the uncertain updated parameters such as geometry and material properties of the structure, local and...

متن کامل

A systolic algorithm for QSVD updating

In earlier reports, a Jacobi-type algorithm for SVD updating has been developed 8] and implemented on a systolic array 9]. Here, this is extended to a generalized decomposition for a matrix pair, viz. the quotient singular value decomposition (QSVD). Updating problems are considered where new rows are appended to either one or both of the matrices involved. Systolic arrays as well as square roo...

متن کامل

An Updating Algorithm forSubspace

abstract In certain signal processing applications it is required to compute the null space of a matrix whose rows are samples of a signal with p components. The usual tool for doing this is the singular value decomposition. However, the singular value decomposition has the drawback that it requires O(p 3) operations to recompute when a new sample arrives. In this paper, we show that a diierent...

متن کامل

Implementation of LU Decomposition and QR Decomposition on Parallel Processing Systems

One of the earliest attempts to implement LU Decomposition with special purpose hardware was using systolic/wavefront arrays[2]. Different proposals for the processing elements(PEs) of systolic/wavefront arrays are provided[3][4][5]. These ideas were not implemented in circuit at that time. The performance of these architectures were not quantitatively evaluated either. In 1994, E. Casseau[6] i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004